Why the Generalized Gradient Approximation Works and How to Go Beyond It
نویسندگان
چکیده
Ž . The local spin density LSD approximation, while of only moderate accuracy, has proven extremely reliable over three decades of use. We argue that any gradient-corrected functional should preserve the correct features of LSD, even if the system under study Ž . contains no regions of small density gradient. The Perdew]Wang 1991 PW91 functional Ž . respects this condition, while, e.g., the Lee]Yang]Parr LYP correlation functional violates it. We extend this idea to the next generation of density functionals, those which Ž . incorporate exact exchange via the optimized effective potential OEP , with a model in which the correlation hole is constructed from the exact exchange hole. The resulting exchange-correlation hole is deeper and less diffuse than the exact exchange hole. We denote such a functional as ‘‘locally correlated Hartree]Fock’’ and list a variety of conditions such a functional should satisfy. We demonstrate the promise of this approach with a crude simple model. Q 1997 John Wiley & Sons, Inc. Introduction and Summary of Conclusions Ž . or many years, the local spin density LSD F w x approximation 1 has been the mainstay of electronic structure calculations in solid-state * To whom correspondence should be addressed. Permanent address after July 1, 1996: Department of Chemistry, Rutgers University, Camden, NJ 08102. w x physics 2]4 . This approximation may be written LSD 3 unif w x Ž . Ž . Ž . E n , n s d r n r e n r , n r , H xc x xc x
منابع مشابه
SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملGeneralized gradient expansion for inhomogeneous dynamical mean-field theory: Application to ultracold atoms in a harmonic trap
We develop a generalized gradient expansion of the inhomogeneous dynamical mean-field theory method for determining properties of ultracold atoms in a trap. This approach goes beyond the well-known local density approximation and at higher temperatures, in the normal phase, it shows why the local density approximation works so well, since the local density and generalized gradient approximation...
متن کاملBeyond Compassion: Replacing a Blame Culture With Proper Emotional Support and Management; Comment on “Why and How Is Compassion Necessary to Provide Good Quality Healthcare?”
The absence of compassion, argues the author, is not the cause of healthcare failures but rather a symptom of deeper systemic failures. The clinical encounter arouses strong emotions of anxiety, fear, and anger in patients which are often projected onto the clinicians. Attempts to protect clinicians through various bureaucratic devices and depersonalization of the patient, constitute as Menzies...
متن کاملThat Philosophy as Epistemological-Based is Not Debased: A Critique of Post-Modernist/Hermeneutic Critique of Traditional Philosophy
Over the centuries, beginning with the classic Greeks through the trends of the mid-20th century, philosophical enterprise has been intricately and seemingly irretrievably rooted in the theory of the given—an edification of philosophy as that giant mirror and standard for measuring what counts as knowledge; but is it thus synonymous with or reducible to epistemology? How or why? There are two a...
متن کاملShort-range exchange and correlation energy density functionals: beyond the local-density approximation.
We propose approximations which go beyond the local-density approximation for the short-range exchange and correlation density functionals appearing in a multideterminantal extension of the Kohn-Sham scheme. A first approximation consists of defining locally the range of the interaction in the correlation functional. Another approximation, more conventional, is based on a gradient expansion of ...
متن کامل